A topological approach to the Arrow impossibility theorem when individual preferences are weak orders

نویسنده

  • Yasuhito Tanaka
چکیده

We will present a topological approach to the Arrow impossibility theorem of social choice theory that there exists no binary social choice rule (which we will call a social welfare function) which satisfies the conditions of transitivity, independence of irrelevant alternatives (IIA), Pareto principle and non-existence of dictator. Our research is in line with the studies of topological approaches to discrete social choice problems initiated by Baryshnikov [Y. Baryshnikov, Unifying impossibility theorems: a topological approach, Advances in Applied Mathematics 14 (1993) 404–415]. But tools and techniques of algebraic topology which we will use are more elementary than those in Baryshnikov [Y. Baryshnikov, Unifying impossibility theorems: a topological approach, Advances in Applied Mathematics 14 (1993) 404–415]. Our main tools are homology groups of simplicial complexes. And we will consider the case where individual preferences are weak orders, that is, individuals may be indifferent about any pair of alternatives. This point is an extension of the analysis by Baryshnikov [Y. Baryshnikov, Unifying impossibility theorems: a topological approach, Advances in Applied Mathematics 14 (1993) 404–415]. 2005 Elsevier Inc. All rights reserved. 0096-3003/$ see front matter 2005 Elsevier Inc. All rights reserved. doi:10.1016/j.amc.2005.05.021 E-mail address: [email protected] 962 Y. Tanaka / Appl. Math. Comput. 174 (2006) 961–981

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Hex Game Theorem and the Arrow Impossibility Theorem: the Case of Weak Orders

The Arrow impossibility theorem when individual preferences are weak orders is equivalent to the HEX game theorem. Because Gale showed that the Brouwer fixed point theorem is equivalent to the HEX game theorem, this paper indirectly shows the equivalence of the Brouwer fixed point theorem and the Arrow impossibility theorem. Chichilnisky showed the equivalence of her impossibility theorem and t...

متن کامل

Arrow theorems in the fuzzy setting

Throughout this paper, our  main idea is to analyze the Arrovian approach in a fuzzy context, paying attention to different extensions of the classical Arrow's model arising in mathematical Social Choice to aggregate preferences that the agents define on a set of alternatives. There is a wide set of extensions. Some of them give rise to an impossibility theorem as in the Arrovian classical  mod...

متن کامل

On the topological equivalence of the Arrow impossibility theorem and Amartya Sen's liberal paradox

We will show that the Arrow impossibility theorem for binary social choice rules that there exists no binary social choice rule which satisfies transitivity, Pareto principle, independence of irrelevant alternatives (IIA), and has no dictator, and Amartya Sen’s liberal paradox for binary social choice rules that there exists no binary social choice rule which satisfies acyclicity, Pareto princi...

متن کامل

Social choice problems with a minimally discontinuous mapping

Social choice theory is concerned with problems of getting from information on individual reports over alternative states of the world to an acceptable means for making a collective decision over these alternatives. These problems were originally studied in the combinatorical framework provided by Arrow type impossibility theorems. More recently Chichilnisky and others have studied the problem ...

متن کامل

Preference Strength and Two Kinds of Ordinalism*

In his paper "Extended Sympathy and the Possibility of Social Choice", Professor Arrow first considers an approach to individual utilities which is "strictly ordinal" and rules out interpersonal comparisons. This is the approach he took when he formulated his original impossibility theorem [1]. He then takes up an approach which allows interperso~al comparisons, but only of an ordinal kind. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 174  شماره 

صفحات  -

تاریخ انتشار 2006